Reasoning and Explanation in EL and in Expressive Description Logics
نویسنده
چکیده
Description Logics (DLs) are the formalism underlying the standard web ontology language OWL 2. DLs have formal semantics which are the basis for powerful reasoning services. In this paper, we introduce the basic notions of DLs and the techniques that realize subsumption—the fundamental reasoning service of DL systems. We discuss two reasoning methods for this service: the tableau method for expressive DLs such as ALC and the completion method for the light-weight DL EL. We also present methods for generating explanations for computed subsumption relationships in these two DLs.
منابع مشابه
On Conjunctive Query Answering in EL
In this paper we study conjunctive query answering in the description logics of the EL family [2, 3, 7, 6, 5], in particular we consider the DLs EL, ELH, EL, and EL. The EL family has been recently defined in order to identify DLs both having interesting expressive abilities and allowing for tractable reasoning. While the standard reasoning tasks (like concept subsumption and instance checking)...
متن کاملParaconsistent Reasoning for Expressive and Tractable Description Logics
Four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases, mainly ALC. This approach has a distinct advantage that it can be implemented by invoking classical reasoners to keep the same complexity as classical semantics. In this paper, we further study how to extend the four-valued semantics to more expressive description logics, such as...
متن کاملCEL—A Short System Demonstration
Description logics (DLs) are an important family of formalisms for reasoning about ontologies. CEL (Classifier for EL) is a free (for non-commercial use) LISP-based reasoner for the description logic EL [2], supporting as its main reasoning task the computation of the subsumption hierarchy induced by EL ontologies. The most distinguishing feature of CEL is that, unlike other modern DL reasoners...
متن کاملClassifying Fuzzy Subsumption in Fuzzy-EL+
Fuzzy Description Logics (f-DLs) have been proposed as extensions of classical Description Logics able to handle imprecise and vague knowledge. Although several extensions to expressive DLs have been proposed today and many reasoning algorithms exist there is still no scalable and efficient reasoning system reported, mainly due to inherited computational complexity from crisp DLs and the lack f...
متن کاملComplexity of Abduction in the EL Family of Lightweight Description Logics
The complexity of logic-based abduction has been extensively studied for the case in which the background knowledge is represented by a propositional theory, but very little is known about abduction with respect to description logic knowledge bases. The purpose of the current paper is to examine the complexity of logic-based abduction for the EL family of lightweight description logics. We cons...
متن کامل